Activation network problems

Network design problems traditionally are modelled by a graph where each edge (or node) has a fixed cost. We investigate optimization problems in a realistic model for wireless network design called activation network. The activation network setting can be defined as follows. We are given a directed or undirected graph G = (V,E) together with a family {fuv : (u, v) ∈ E} of monotone nondecreasing activation functions from D to {0, 1}, where D is a constant-size subset of the non-negative real numbers, such that the activation of an edge depends on the chosen values from the domain D at its endpoints. An edge (u, v) ∈ E is activated for chosen values xu and xv if fuv(xu, xv) = 1, and the activation function fuv is called monotone non-decreasing if fuv (xu, xv) = 1 implies fuv (yu, yv) = 1 for any yu ≥ xu, yv ≥ xv. The objective of activation network problems is to find activation values xv ∈ D for all v ∈ V such that the total activation cost ∑ v∈V xv is minimized and the activated set of edges satisfies some connectivity requirements. We give a 1.5-approximation algorithm for the minimum activation cost of k node-disjoint st-paths (st-MANDP) when k = 2. We also show that a ρ-approximation algorithm for the st-MANDP problem implies a ρ-approximation algorithm for solving the minimum activation cost of k edgedisjoint st-paths (st-MAEDP) problem when k = 2. We propose polynomial time algorithms that optimally solve the st-MANDP, st-MAEDP, minimum activation Steiner tree and the problem of finding minimum activation cost node-disjoint paths between k disjoint terminal pairs for graphs with treewidth bounded by a constant. We also study the st-MANDP, st-MAEDP, minimum spanning activation tree and minimum activation arborescence problems for the special case where |D| = 2 and all edges have the same activation function. i To my parents, Huda Almuzaini and Mohsen Alqahtani